Phase Semantics for Light Linear Logic (Extended Abstract)
نویسندگان
چکیده
منابع مشابه
Phase semantics for light linear logic
Light linear logic 1] is a reenement of the propositions-as-types paradigm to polynomial-time computation. A semantic setting for the underlying logical system is introduced here in terms of bred phase spaces. Strong completeness is established, with a purely semantic proof of cut elimination as a consequence. A number of mathematical examples of bred phase spaces are presented that illustrate ...
متن کاملFull Intuitionistic Linear Logic (extended abstract)
Hyland, M. and V. de Paiva, Full intuitionistic linear logic (extended abstract), Annals of Pure and Applied Logic 64 (1993) 273-291. In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicati...
متن کاملGames and Full Completeness for Multiplicative Linear Logic (Extended Abstract)
We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy;...
متن کاملSurface Proofs for Nonsymmetric Linear Logic (Extended Abstract)
Multiplicative linear logic [6, 7] is a formal calculus for reasoning about resources, which is similar to traditional logic, except that resources cannot be duplicated or neglected in the way that propositions can. A central problem in logic is determining when two proofs should be considered equivalent. In this paper, we describe a scheme for interpreting proofs in multiplicative linear logic...
متن کاملA Rewriting Logic Approach to Operational Semantics (Extended Abstract)
This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: big-step and small-step structural operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, and continuation-based semantics. Each of these language de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1997
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80159-8